The Maximum Scatter TSP on a Regular Grid
نویسندگان
چکیده
In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting processes. We extend an algorithm by Arkin et al. that yields optimal solutions for nodes on a line to a regular m×n-grid. The new algorithm Weave(m,n) takes linear time to compute an optimal tour in some cases. It is asymptotically optimal and a √ 10 5 -approximation for the 3 × 4-grid, which is the worst case.
منابع مشابه
A PTAS for Euclidean Maximum Scatter TSP
We study the problem of finding a tour of n points in R in which every edge is long. More precisely, we wish to find a tour that maximizes the length of the shortest edge in the tour. The problem is known as Maximum Scatter TSP, and it was introduced by Arkin et al. (SODA 1997), motivated by applications in manufacturing and medical imaging. Arkin et al. gave a 2-approximation for the metric ve...
متن کاملMaximum Scatter TSP in Doubling Metrics
We study the problem of finding a tour of n points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter TSP, and was introduced by Arkin et al. (SODA 1997), motivated by applications in manufacturing and medical imaging. Arkin et al. gave a 0.5 -ap...
متن کاملExperimental analysis of heuristics for the bottleneck traveling salesman problem
In this paper we develop efficient heuristic algorithms to solve the bottleneck traveling salesman problem (BTSP). Results of extensive computational experiments are reported. Our heuristics produced optimal solutions for all the test problems considered from TSPLIB, JM-instances, National TSP instances, and VLSI TSP instances in very reasonable running time. We also conducted experiments with ...
متن کاملتحلیل ممیز غیرپارامتریک بهبودیافته برای دستهبندی تصاویر ابرطیفی با نمونه آموزشی محدود
Feature extraction performs an important role in improving hyperspectral image classification. Compared with parametric methods, nonparametric feature extraction methods have better performance when classes have no normal distribution. Besides, these methods can extract more features than what parametric feature extraction methods do. Nonparametric feature extraction methods use nonparametric s...
متن کاملThe traveling salesman problem on grids with forbidden neighborhoods
We introduce the Traveling Salesman Problem with forbidden neighborhoods (TSPFN). This is an extension of the Euclidean TSP in the plane where direct connections between points that are too close are forbidden. The TSPFN is motivated by an application in laser beam melting. In the production of a workpiece in several layers using this method one hopes to reduce the internal stresses of the work...
متن کامل